A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Dharani, Andhe
- Implementation of Performance Evaluation Methodologies for the Ad-Hoc on-Demand Distance Vector Routing Protocols
Authors
1 Department of MCA, R.V.College of Engineering, Bangalore, IN
Source
Networking and Communication Engineering, Vol 2, No 10 (2010), Pagination: 387-393Abstract
Mobile Ad-hoc Networks (MANETs) allow wireless nodes to form a network without requiring a fixed infrastructure. Early routing protocols for MANETs failed to take security issues into account. Subsequent proposals used strong cryptographic methods to secure the routing information. In this paper, we give the comparison SAODV and TAODV, two MANET routing protocols, which address routing security through cryptographic and trust-based means respectively.
In this work, we have compared the SAODV and TAODV protocols for securing ad-hoc network routing. We presented the results of implementation and evaluation of both protocols. The expected difference between the two protocols was shown to be consistent with this real world scenario. It shows that SAODV is indeed a significantly more expensive than TAOAV protocol. These experiments showed that there is significant room between the two protocols for a secure hybrid protocol to be developed which takes advantage of the strongest points of both.
Keywords
Mobile Ad-Hoc Networks (MANETs), SAODV, TAODV.
- A Distributed Cache Architecture with Snooping for QoS Routing in Large Networks
Authors
1 Master of Computer Applications Department, R.V. College of Engineering, Bangalore, IN
Source
Networking and Communication Engineering, Vol 1, No 3 (2009), Pagination: 104-109Abstract
To meet the diverse quality-of-service (QoS) requirements of emerging multimedia applications, communication networks should provide end-to-end QoS guarantees. QoS routing is the first step towards this goal. The route computing overhead caused by on-demand calculation of QoS routes, especially in large networks with heavy traffic, is a concern and can cause scalability problems. This paper addresses this problem by introducing a novel distributed cache architecture. The distributed nature of the proposed cachearchitecture facilitates its deployment in large networks. To maximize the performance of the distributed cache architecture, cache snooping has been proposed to alleviate the side effects of network states fluctuations on the cached route so that the overall routing performance is significantly improved. Assuming a bandwidth-based QoS model, in performance evaluation of the proposed distributed cache architecture, we use a broad range of realistic network topologies, network traffic conditions, routing protocols, and aggregation techniques to evaluate different aspects of the proposed cache architecture under different conditions. The results confirm that the route caching is quite effective in reduction of route computing overhead. In addition, our results suggest that the cache snooping can significantly increase the overall routing performance, especially in the presence of highly inaccurate network state information.